Cohen-like first order structures

نویسندگان

چکیده

We study uncountable structures similar to the Fraïssé limits. The standard inductive arguments from theory are replaced by forcing, so we obtain highly sensitive universe of set theory. In particular, generic investigate exist only in extensions universe. prove that most interesting cases rigid. Moreover, provide a (consistent) example an uncountable, dense reals with group integers as its automorphism group.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homomorphism Problems for First-Order Definable Structures

We investigate several variants of the homomorphism problem: given two relational structures, is there a homomorphism from one to the other? The input structures are possibly infinite, but definable by first-order interpretations in a fixed structure. Their signatures can be either finite or infinite but definable. The homomorphisms can be either arbitrary, or definable with parameters, or defi...

متن کامل

Definability by Programs in First-Order Structures

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ti 1. Preliminarv detinitilms and results . . . . . . . . . . . . . . . . . . . . . . . . . Algebraic characterizations of the unwind property .................. A structure with the unwind property for every iterative (but not every recursive 1 program . The truth-table property ............................. Struc...

متن کامل

First order axiomatization of typed feature structures

We axiomatize, in first order logic, the typed feature structures used in constraint based grammar formalism for natural language processing. This is based on a discussion of how type-hierarchies should be interpreted in terms of representation theory. We close with some observations about decidability of feature constraint satisfaction in parsing.

متن کامل

First order properties on nowhere dense structures

A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special cl...

متن کامل

Order Structures on Böhm-Like Models

We are interested in the question whether the models induced by the infinitary lambda calculus are orderable, that is whether they have a partial order with a least element making the context operators monotone. The first natural candidate is the prefix relation: a prefix of a term is obtained by replacing some subterms by ⊥. We prove that six models induced by the infinitary lambda calculus (w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2023

ISSN: ['0168-0072', '1873-2461']

DOI: https://doi.org/10.1016/j.apal.2022.103172